Space-efficient parallel algorithms for combinatorial search problems
نویسندگان
چکیده
منابع مشابه
Space-Efficient Parallel Algorithms for Combinatorial Search Problems
We present space-efficient parallel strategies for two fundamental combinatorial search problems, namely, backtrack search and branch-and-bound, both involving the visit of an n-node tree of height h under the assumption that a node can be accessed only through its father or its children. For both problems we propose efficient algorithms that run on a distributed-memory machine with p processor...
متن کاملOn Parallel Algorithms for Combinatorial Problems
Graphs are the most widely used of all mathematical structures. There is uncountable number of interesting computational problems de ned in terms of graphs. A graph can be seen as a collection of vertices (V ), and a collection of edges (E) joining all or some of the vertices. One is very often interested in nding subsets, either from the set V of vertices or from the set E of edges, which poss...
متن کاملExperiments with Parallel Algorithms for Combinatorial Problems
In the last decade many models for parallel computation have been proposed and many parallel algorithms have been developed. However, few of these models have been realized and most of these algorithms are supposed to run on idealized, unrealistic parallel machines. The parallel machines constructed so far all use a simple model of parallel computation. Therefore, not every existing parallel ma...
متن کاملSpace Efficient Algorithms for Series-Parallel Graphs
The subclass of directed series-parallel graphs plays an important role in computer science. To determine whether a graph is series-parallel is a well studied problem in algorithmic graph theory. Fast sequential and parallel algorithms for this problem have been developed in a sequence of papers. For series-parallel graphs methods are also known to solve the reachability and the decomposition p...
متن کاملEfficient Parallel Algorithms for Parabolic Problems
Domain decomposition algorithms for parallel numerical solution of parabolic equations are studied for steady state or slow unsteady computation. Implicit schemes are used in order to march with large time steps. Parallelization is realized by approximating interface values using explicit computation. Various techniques are examined, including a multistep second order explicit scheme and a one-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Parallel and Distributed Computing
سال: 2015
ISSN: 0743-7315
DOI: 10.1016/j.jpdc.2014.09.007